Suppressing dislocations in normalized hypercubic smearing

Logarithmic link smearing for full QCD

A new Lie-algebra based recipe for analytic link smearing in lattice QCD is presented. It is more efficient in suppressing UV-noise than the standard “stout” smearing, roughly comparable to traditional APE smearing. It may be used together with the hypercubic nesting trick, and the advantage is that this LOG/HYL smearing yields differentiable “fat” links, which makes it attractive for a HMC app...

Dynamic Hypercubic Parallel Computations

Though there have been substantial progress, the current status of parallel computing is still inmature. No single model of parallel computation has yet come to dominate developments in parallel computing in the way that the von Neumann model has dominated sequential computing. The design of parallel programs requires fancy solutions that are not present in sequential programming. There are spe...

Normalized Tenacity and Normalized Toughness of Graphs

In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters.  Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.

Hypercubic Sorting Networks

This paper provides an analysis of a natural d-round tournament over n = 2 d players, and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design eecient sorting algorithms for a variety of diierent models of parallel computation: (i) a comparator network of depth c lg n, c 7:44, that sorts the vast majority of...

Interconnection Networks with Hypercubic Skeletons